1016A - Death Note - CodeForces Solution


greedy implementation math *900

Please click on ads to support us..

Python Code:

n,m=map(int,input().split())
a=list(map(int,input().split()))
s=0
for x in range(n):
    print((s+a[x])//m,end=' ')
    s=(s+a[x])%m

C++ Code:

#include <bits/stdc++.h>
#define ll long long
#define pp pop_back
#define sz size()
#define N 200005
#define ff first
#define ss second
#define pb push_back
using namespace std;

int t, n, a[N], m, s;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		s += a[i]; 
		cout << s / m << ' ';
		if(s / m > 0){
			s = (s % m);
		}
	}
}


Comments

Submit
0 Comments
More Questions

765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat
119A - Epic Game
703A - Mishka and Game
1504C - Balance the Bits
988A - Diverse Team
1312B - Bogosort
1616B - Mirror in the String
1660C - Get an Even String
489B - BerSU Ball
977C - Less or Equal
1505C - Fibonacci Words
1660A - Vasya and Coins
1660E - Matrix and Shifts
1293B - JOE is on TV
1584A - Mathematical Addition
1660B - Vlad and Candies
1472C - Long Jumps
1293D - Aroma's Search
918A - Eleven